Translational lemmas, polynomial time, and (log n)j-space
نویسندگان
چکیده
منابع مشابه
Log-time and Log-space Extreme Classification
We present LTLS, a technique for multiclass and multilabel prediction that can perform training and inference in logarithmic time and space. LTLS embeds large classification problems into simple structured prediction problems and relies on efficient dynamic programming algorithms for inference. We train LTLS with stochastic gradient descent on a number of multiclass and multilabel datasets and ...
متن کاملAutoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions
We investigate the autoreducibility and mitoticity of complete sets for several classes with respect to different polynomial-time and logarithmic-space reducibility notions. Previous work in this area focused on polynomial-time reducibility notions. Here we obtain new mitoticity and autoreducibility results for the classes EXP and NEXP with respect to some restricted truth-table reductions (e.g...
متن کاملPolynomial Min/Max-weighted Reachability is in Unambiguous Log-space
For a graph G(V,E) and a vertex s ∈ V , a weighting scheme (w : E → N) is called a min-unique (resp. max-unique) weighting scheme, if for any vertex v of the graph G, there is a unique path of minimum(resp. maximum) weight1 from s to v. Instead, if the number of paths of minimum(resp. maximum) weight is bounded by n for some constant c, then the weighting scheme is called a min-poly (resp. max-...
متن کاملCertifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
In earlier work of Kristiansen and Niggl the polynomial-time computable functions were characterised by stack programs of μ-measure 0, and the linear-space computable functions by loop programs of μ-measure 0. Until recently, an open problem was how to extend these characterisations to programs with user-friendly basic instructions, such as assignment statements, and with mixed data structures....
متن کاملSpace Dilation in Polynomial-Time Perceptron Algorithms
This talk surveys applications of space dilation in the perceptron-like algorithms for solving systems of linear inequalities in polynomial time: from the ellipsoid algorithm to the modified perceptron algorithm and the perceptron rescaling algorithm. It also suggests a more general version of the latter algorithm and poses an open problem about the lowest complexity of this approach. Space dil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1976
ISSN: 0304-3975
DOI: 10.1016/0304-3975(76)90057-8